Calculating Optimal Flit Size and Upper Limit on the Performance of Wormhole Routing
نویسندگان
چکیده
The emergence of large scale distributed memory computers has brought with it a variety of interconnection networks. As it is not feasible to fully interconnect the processors with a diameter of one, routing of messages is necessary. Wormhole routing is an efficient method of routing and in this paper, we derive a model for wormhole routing. Using this model, we determine the optimal buffer size, and hence show that for medium to large messages, the communication time using wormhole routing is dependent on the square root of the network diameter. Keywords—Parallel Distributed Computing, Hypercube, Mesh, Performance Parameters, Wormhole routing Source of Publication—The paper was presented to the ICA3PP-97 conference, Melbourne, December 1997 and appeared in the proceedings.
منابع مشابه
Improving the Performance of a Wormhole Router and Wormhole Flow Control
As an emerging and advanced technology, Network-on-Chip (NoC) may become the alternative of the traditional bus-based System-on-Chip (SoC). In an interconnection network structure, interconnected routers are the core of the whole system and the network’s performance mainly depends on their performance. There are many significant factors which determine the working mechanism of a router and its ...
متن کاملPerformance bounds in wormhole routing, a network calculus approach
We present a model of performance bound calculus on feedforward networks where data packets are routed under wormhole routing discipline. We are interested in determining maximum end-to-end delays and backlogs of messages or packets going from a source node to a destination node, through a given virtual path in the network. Our objective here is to give a network calculus approach for calculati...
متن کاملA Performance Enhanced and Cost Effective Deadlock Recovery Scheme for Adaptive Wormhole Routed Networks
Deadlock free routing of messages is a challenge for the performance of directly connected network systems. Communication among the nodes of a directly connected multicomputer system is via message exchange. The wormhole routing is perceived as the best switching technique in directly connected systems. The technique suffers the challenges like deadlock avoidance. Deadlock recovery faces cost o...
متن کاملAn Analysis of Deflection-Based Wormhole Routing with Virtual Channels
We analyze a new wormhole routing scheme, which we call the wormhole deflection with virtual channels (abbreviated WDVC) scheme, that combines wormhole routing with virtual channels and deflection routing to provide efficient lossless communication. We use new analytical models to analyze the performance of the WDVC scheme for the Manhattan Street (MS) network topology. In particular, we examin...
متن کاملA two-phase wormhole attack detection scheme in MANETs
Mobile ad-hoc networks (MANETs) have no fixed infrastructure, so all network operations such as routing and packet forwarding are done by the nodes themselves. However, almost all common existing routing protocols basically focus on performance measures regardless of security issues. Since these protocols consider all nodes to be trustworthy, they are prone to serious security threats. Wormhole...
متن کامل